Restricted Weighted Integer Compositions and Extended Binomial Coefficients
نویسنده
چکیده
We prove a simple relationship between extended binomial coefficients — natural extensions of the well-known binomial coefficients — and weighted restricted integer compositions. Moreover, we give a very useful interpretation of extended binomial coefficients as representing distributions of sums of independent discrete random variables. We apply our results, e.g., to determine the distribution of the sum of k logarithmically distributed random variables, and to determining the distribution, specifying all moments, of the random variable whose values are part-products of random restricted integer compositions. Based on our findings and using the central limit theorem, we also give generalized Stirling formulae for central extended binomial coefficients. We enlarge the list of known properties of extended binomial coefficients.
منابع مشابه
Some Elementary Congruences for the Number of Weighted Integer Compositions
An integer composition of a nonnegative integer n is a tuple (π1, . . . , πk) of nonnegative integers whose sum is n; the πi’s are called the parts of the composition. For fixed number k of parts, the number of f -weighted integer compositions (also called f -colored integer compositions in the literature), in which each part size s may occur in f(s) different colors, is given by the extended b...
متن کاملOn the composition of an arbitrary collection of $SU(2)$ spins: An Enumerative Combinatoric Approach
The whole enterprise of spin compositions can be recast as simple enumerative combinatoric problems. We show here that enumerative combinatorics (EC)\citep{book:Stanley-2011} is a natural setting for spin composition, and easily leads to very general analytic formulae -- many of which hitherto not present in the literature. Based on it, we propose three general methods for computing spin multip...
متن کاملWeighted quadrature rules with binomial nodes
In this paper, a new class of a weighted quadrature rule is represented as -------------------------------------------- where is a weight function, are interpolation nodes, are the corresponding weight coefficients and denotes the error term. The general form of interpolation nodes are considered as that and we obtain the explicit expressions of the coefficients using the q-...
متن کاملGeneralizing the Combinatorics of Binomial Coefficients via !-nomials
An !-sequence is defined by an = !an−1 − an−2, with initial conditions a0 = 0, a1 = 1. These !-sequences play a remarkable role in partition theory, allowing !generalizations of the Lecture Hall Theorem and Euler’s Partition Theorem. These special properties are not shared with other sequences, such as the Fibonacci sequence, defined by second-order linear recurrences. The !-sequence gives rise...
متن کاملThe Combinatorics of Weighted Vector Compositions
A vector composition of a vector l is a matrix A whose rows sum to l. We define a weighted vector composition as a vector composition in which the column values of A may appear in different colors. We study vector compositions from different viewpoints: (1) We show how they are related to sums of random vectors and (2) how they allow to derive formulas for partial derivatives of composite funct...
متن کامل